翻訳と辞書 |
Mabinogion sheep problem : ウィキペディア英語版 | Mabinogion sheep problem In probability theory, the Mabinogion sheep problem or Mabinogian urn is a problem in stochastic control introduced by , who named it after a herd of magic sheep in the Welsh epic Mabinogion. ==Statement==
At time ''t'' = 0 there is a herd of sheep each of which is black or white. At each time ''t'' = 1, 2, ... a sheep is selected at random, and a sheep of the opposite color (if one exists) is changed to be the same color as the selected sheep. At any time one may remove as many sheep (of either color) as one wishes from the herd. The problem is to do this in such a way as to maximize the expected final number of black sheep. The optimal solution at each step to remove just enough white sheep so that there are more black sheep than white sheep.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Mabinogion sheep problem」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|